Public Key Encryption with Searchable Keywords Based on Jacobi Symbols
نویسندگان
چکیده
Vishal Saraswat (CRRao AIMSCS) Searchable Encryption APHRDI, 22/09/16 10 / 46 Vishal Saraswat Some other projects Abstract Public-key encryption with keyword search (PEKS) schemes are useful to delegate searching capabilities on encrypted data to a third party, who does not hold the entire secret key, but only an appropriate token which allows searching operations but preserves data privacy. PEKS has been proved to be equivalent to anonymous (or key-private) identity based encryption which are useful for fully-private communication.Public-key encryption with keyword search (PEKS) schemes are useful to delegate searching capabilities on encrypted data to a third party, who does not hold the entire secret key, but only an appropriate token which allows searching operations but preserves data privacy. PEKS has been proved to be equivalent to anonymous (or key-private) identity based encryption which are useful for fully-private communication. Vishal Saraswat (CRRao AIMSCS) Searchable Encryption APHRDI, 22/09/16 10 / 46 Motivation Section Outline 3 Motivation Problem Scenario 1 Problem Scenario 2 Problem Formalization Vishal Saraswat (CRRao AIMSCS) Searchable Encryption APHRDI, 22/09/16 10 / 46 Motivation Problem Scenario 1 Anonymous Identity Based Encryption An Indian agent in Pakistan wants to receive messages from India or other Indian agents. We provide the only existing non-trivial method of converting a non-anonymous IBE to an anonymous IBE. [1] Vishal Saraswat (CRRao AIMSCS) Searchable Encryption APHRDI, 22/09/16 11 / 46 Motivation Problem Scenario 1 Anonymous Identity Based Encryption An Indian agent in Pakistan wants to receive messages from India or other Indian agents. All emails entering Pakistan from India are monitored to whom they are going etc. We provide the only existing non-trivial method of converting a non-anonymous IBE to an anonymous IBE. [1] Vishal Saraswat (CRRao AIMSCS) Searchable Encryption APHRDI, 22/09/16 11 / 46 Motivation Problem Scenario 1 Anonymous Identity Based Encryption An Indian agent in Pakistan wants to receive messages from India or other Indian agents. All emails entering Pakistan from India are monitored to whom they are going etc. Even if the email cannot be read they can trace the route etc. We provide the only existing non-trivial method of converting a non-anonymous IBE to an anonymous IBE. [1] Vishal Saraswat (CRRao AIMSCS) Searchable Encryption APHRDI, 22/09/16 11 / 46 Motivation Problem Scenario 1 Anonymous Identity Based Encryption An Indian agent in Pakistan wants to receive messages from India or other Indian agents. All emails entering Pakistan from India are monitored to whom they are going etc. Even if the email cannot be read they can trace the route etc. Anonymous identity based encryption (aIBE) allows the recipient: We provide the only existing non-trivial method of converting a non-anonymous IBE to an anonymous IBE. [1] Vishal Saraswat (CRRao AIMSCS) Searchable Encryption APHRDI, 22/09/16 11 / 46 Motivation Problem Scenario 1 Anonymous Identity Based Encryption An Indian agent in Pakistan wants to receive messages from India or other Indian agents. All emails entering Pakistan from India are monitored to whom they are going etc. Even if the email cannot be read they can trace the route etc. Anonymous identity based encryption (aIBE) allows the recipient: to remain anonymous. We provide the only existing non-trivial method of converting a non-anonymous IBE to an anonymous IBE. [1] Vishal Saraswat (CRRao AIMSCS) Searchable Encryption APHRDI, 22/09/16 11 / 46 Motivation Problem Scenario 1 Anonymous Identity Based Encryption An Indian agent in Pakistan wants to receive messages from India or other Indian agents. All emails entering Pakistan from India are monitored to whom they are going etc. Even if the email cannot be read they can trace the route etc. Anonymous identity based encryption (aIBE) allows the recipient: to remain anonymous. to communicate with other agents who do not know the full identity but only certain attributes. We provide the only existing non-trivial method of converting a non-anonymous IBE to an anonymous IBE. [1] Vishal Saraswat (CRRao AIMSCS) Searchable Encryption APHRDI, 22/09/16 11 / 46 Motivation Problem Scenario 2 Public-Key Encryption with Searchable
منابع مشابه
Browse searchable encryption schemes: Classification, methods and recent developments
With the advent of cloud computing, data owners tend to submit their data to cloud servers and allow users to access data when needed. However, outsourcing sensitive data will lead to privacy issues. Encrypting data before outsourcing solves privacy issues, but in this case, we will lose the ability to search the data. Searchable encryption (SE) schemes have been proposed to achieve this featur...
متن کاملAnonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts
Efficient and privacy-preserving constructions for search functionality on encrypted data is important issues for data outsourcing, and data retrieval, etc. Fully secure anonymous Hierarchical ID-Based Encryption (HIBE) schemes is useful primitives that can be applicable to searchable encryptions [4], such as ID-based searchable encryption, temporary searchable encryption [1], and anonymous for...
متن کاملDecryptable Searchable Encryption
As such, public-key encryption with keyword search (a.k.a PEKS or searchable encryption) does not allow the recipient to decrypt keywords i.e. encryption is not invertible. This paper introduces searchable encryption schemes which enable decryption. An additional feature is that the decryption key and the trapdoor derivation key are totally independent, thereby complying with many contexts of a...
متن کاملSearching Keywords with Wildcards on Encrypted Data
A hidden vector encryption scheme (HVE) is a derivation of identity-based encryption, where the public key is actually a vector over a certain alphabet. The decryption key is also derived from such a vector, but this one is also allowed to have “?” (or wildcard) entries. Decryption is possible as long as these tuples agree on every position except where a “?” occurs. These schemes are useful fo...
متن کاملBlind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data
Searchable encryption schemes provide an important mechanism to cryptographically protect data while keeping it available to be searched and accessed. In a common approach for their construction, the encrypting entity chooses one or several keywords that describe the content of each encrypted record of data. To perform a search, a user obtains a trapdoor for a keyword of her interest and uses t...
متن کامل